'
\ufeffPart I: Defining Program Syntax Exercises \ufeffPoints
Give a BNF grammar for each of the languages below. For example, a correct answer for the set of all strings consisting of zero or more concatenated copies of the string ab \ufeffwould be this grammar:
\ufeff:: \ufeffab \ufeff
There are often many correct answers.
\ufeffpoints \ufeffThe set of all strings consisting of one or more instances of the letter a
\ufeffpoints \ufeffShow that your grammar can derive the following sentences:
a
aa
aaa
\ufeffpoints \ufeffThe set of all strings consisting of one or more instances of the letter a with a semicolon after each one.
\ufeffpoints \ufeffShow that your grammar can derive the following sentences:
a;
a; a;
a; a; a;
\ufeffpoints \ufeffThe set of all strings consisting of an uppercase letter followed by zero or more additional characters, each of which is either an uppercase letter or one of the digits \ufeffthrough
\ufeffpoints \ufeffShow that your grammar can derive the following sentences:
A
AA
A
AA
AA
\ufeffpoints \ufeffThe set of all strings consisting of an open bracket the symbol \ufefffollowed by a list of one or more digits separated by commas, followed by a closing bracket the symbol \ufeffNote that the digits are \ufeffthrough
\ufeffpoints \ufeffShow that your grammar can derive the following sentences:
'